منابع مشابه
Verifying the Unification Algorithm in LCF
Manna and Waldinger’s theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating the theory into LCF’s domaintheoretic logic is largely straightforward. Well-founded induction on a complex ordering is translated into nested structural indu...
متن کاملVerifying the Leader Election Algorithm in GROOVE
In this paper we present how the leader election protocol specified in [1] was modelled with the GROOVE tool set. The goal of this protocol is to find the smallest of a set of uniquely numbered processes arranged in a ring, without having a central controller available. GROOVE is a graph transformation tool, which uses directed simple graphs with labelled edges. In the remainder of this article...
متن کاملLCF Examples in HOL
The LCF system provides a logic of xed point theory and is useful to reason about nontermination, recursive deenitions and innnite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about nite-valued types and strict functions. The HOL system provides set theory and supports reasoning about nite-valued types and total functions well. In...
متن کاملStructured Theories in LCF
Abs t rac t : An extension to the Edinburgh LCF interactive theorem-proving system is described which provides new ways of constructing theories, drawing upon ideas from the Clear specification language. A new theory can be built from an existing theory in two new ways: by renaming its types and constants, or by abstraction (forgetting some types and constants and perhaps renaming the rest]. A ...
متن کاملLinear-Time Algorithm for Long LCF with k Mismatches
In the Longest Common Factor with k Mismatches (LCFk) problem, we are given two strings X and Y of total length n, and we are asked to find a pair of maximal-length factors, one of X and the other of Y , such that their Hamming distance is at most k. Thankachan et al. [26] show that this problem can be solved in O(n log n) time and O(n) space for constant k. We consider the LCFk(l) problem in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1985
ISSN: 0167-6423
DOI: 10.1016/0167-6423(85)90009-7